Temporal Reasoning Through Automatic Translation of tock-CSP into Timed Automata

In this work, we consider translating tock-CSP into Timed Automata for UPPAAL to facilitate using in reasoning about temporal specifications of models. The process algebra provides textual notations modelling discrete-time behaviours, with the support tools automatic verification. Similarly, verification (TA) a graphical notation is supported by real-time toolbox \uppaal. two approaches, TA and tock-CSP, differ both logic refinement, respectively, as well their provided facilities For instance, liveness requirements are difficult specify constructs but they easy verify UPPAAL. To take advantage logic, translate \uppaal; have developed translation technique its supporting tool. We provide rules network small TAs capturing compositional structure that not available TA. validation, start an experimental approach based on finite approximations trace sets. Then, explore mathematical proof establish correctness covering infinite traces.